An Optimal Algorithm for Minimum-Link
نویسندگان
چکیده
We present a new algorithm for finding minimum-link rec8 tilinear paths among rectilinear obstacles in the plane. The algorithm 9 runs in O(n+ h log h) time (after triangulation) and O(n) space, where 10 h is the number of obstacles and n is the total number of their vertices. 11 Further, for any point s, with the same time and space preprocessing as 12 above, given any query point t, we can compute a minimum-link recti13 linear path from s to t in O(logn + k) time, where k is the number of 14 edges of the path. The previously best algorithm solves the problem in 15 O(n logn) time. Our algorithm improves the previous work when h < n. 16
منابع مشابه
Single-Point Visibility Constraint Minimum Link Paths in Simple Polygons
We address the following problem: Given a simple polygon $P$ with $n$ vertices and two points $s$ and $t$ inside it, find a minimum link path between them such that a given target point $q$ is visible from at least one point on the path. The method is based on partitioning a portion of $P$ into a number of faces of equal link distance from a source point. This partitioning is essentially a shor...
متن کاملReliable Designing of Capacitated Logistics Network with Multi Configuration Structure under Disruptions: A Hybrid Heuristic Based Sample Average Approximation Algorithm
We consider the reliable multi configuration capacitated logistics network design problem (RMCLNDP) with system disruptions, concerned with facilities locating, transportation links constructing, and also allocating their limited capacities to the customers in order to satisfy their demands with a minimum expected total cost (including locating costs, link constructing costs, as well as expecte...
متن کاملDynamic Load Carrying Capacity of Flexible Manipulators Using Finite Element Method and Pontryagin’s Minimum Principle
In this paper, finding Dynamic Load Carrying Capacity (DLCC) of flexible link manipulators in point to-point motion was formulated as an optimal control problem. The finite element method was employed for modelling and deriving the dynamic equations of the system. The study employed indirect solution of optimal control for system motion planning. Due to offline nature of the method, many diffic...
متن کاملNear-Minimum-Time Motion Planning of Manipulators along Specified Path
The large amount of computation necessary for obtaining time optimal solution for moving a manipulator on specified path has made it impossible to introduce an on line time optimal control algorithm. Most of this computational burden is due to calculation of switching points. In this paper a learning algorithm is proposed for finding the switching points. The method, which can be used for both ...
متن کاملReliable multi-product multi-vehicle multi-type link logistics network design: A hybrid heuristic algorithm
This paper considers the reliable multi-product multi-vehicle multi-type link logistics network design problem (RMLNDP) with system disruptions, which is concerned with facilities locating, transshipment links constructing, and also allocating them to the customers in order to satisfy their demand on minimum expected total cost (including locating costs, link constructing costs, and also expect...
متن کاملMulticast computer network routing using genetic algorithm and ant colony
Due to the growth and development of computer networks, the importance of the routing topic has been increased. The importance of the use of multicast networks is not negligible nowadays. Many of multimedia programs need to use a communication link to send a packet from a sender to several receivers. To support such programs, there is a need to make an optimal multicast tree to indicate the opt...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015